By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 13, Issue 3, pp. 441-667

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

An Algorithm for the General Petri Net Reachability Problem

Ernst W. Mayr

pp. 441-460

Quantitative Relativizations of Complexity Classes

Ronald V. Book, Timothy J. Long, and Alan L. Selman

pp. 461-487

Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm

Bernard Chazelle

pp. 488-507

Consistency and Serializability in Concurrent Database Systems

D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis II

pp. 508-530

The Organ Pipe Permutation

M. Keane, A. G. Konheim, and I. Meilijson

pp. 531-540

A Mathematical Model for the Verification of Systolic Networks

Rami G. Melhem and Werner C. Rheinboldt

pp. 541-565

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

Robert E. Tarjan and Mihalis Yannakakis

pp. 566-579

Efficient Parallel Algorithms for a Class of Graph Theoretic Problems

Yung H. Tsin and Francis Y. Chin

pp. 580-599

Insertion and Compaction Algorithms in Sequentially Allocated Storage

B. S. Baker and E. G. Coffman, Jr.

pp. 600-609

Movement Problems for $2$-Dimensional Linkages

John Hopcroft, Deborah Joseph, and Sue Whitesides

pp. 610-629

On the Optimum Checkpoint Selection Problem

Sam Toueg and Özalp Babaoglu

pp. 630-649

On Some Variants of the Bandwidth Minimization Problem

Joseph Y-T. Leung, Oliver Vornberger, and James D. Witthoff

pp. 650-667